A method for relaxing the CFL-condition in time explicit schemes

نویسنده

  • A. Hujeirat
چکیده

A method for relaxing the CFL-condition, which limits the time step size in explicit methods in computational fluid dynamics, is presented. The method is based on re-formulating explicit methods in matrix form, and considering them as a special-Jacobi iteration scheme that converge efficiently if the CFLnumber is less than unity. By adopting this formulation, one can design various solution methods in arbitrary dimensions that range from explicit to unconditionally stable implicit methods in which CFL-number could reach arbitrary large values. In addition, we find that adopting a specially varying time stepping scheme accelerates convergence toward steady state solutions and improves the efficiently of the solution procedure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Relaxing the CFL Condition for the Wave Equation on Adaptive Meshes

The Courant-Friedrichs-Lewy (CFL) condition guarantees the stability of the popular explicit leapfrog method for the wave equation. However, it limits the choice of the time step size to be bounded by the minimal mesh size in the spatial finite element mesh. This essentially prohibits any sort of adaptive mesh refinement that would be required to reveal optimal convergence rates on domains with...

متن کامل

Explicit Finite Difference Schemes for the Advection Equation

Conventional explicit nite diierence schemes for the advection equations are subject to the time step restrictions dictated by the CFL condition. In many situations, time step sizes are not chosen to satisfy accuracy requirements but rather to satisfy the CFL condition. In this paper we present explicit algorithms which are stable far beyond the CFL restriction. Similar or even better accuracy ...

متن کامل

Explicit Runge-Kutta Schemes and Finite Elements with Symmetric Stabilization for First-Order Linear PDE Systems

We analyze explicit Runge–Kutta schemes in time combined with stabilized finite elements in space to approximate evolution problems with a first-order linear differential operator in space of Friedrichs-type. For the time discretization, we consider explicit secondand third-order Runge–Kutta schemes. We identify a general set of properties on the spatial stabilization, encompassing continuous a...

متن کامل

Explicit strategies for incompressible fluid-structure interaction problems: Nitsche type mortaring versus Robin-Robin coupling

We discuss explicit coupling schemes for fluid-structure interaction problems where the added mass effect is important. Recalling the explicit method proposed in Comput. Methods Appl. Mech. Engrg. 198(5-8):766– 784, 2009 we make the observation that this scheme is stable under a hyperbolic type CFL condition, but that optimal accuracy imposes a parabolic type CFL conditions due to the splitting...

متن کامل

Solving a system of 2D Burgers' equations using Semi-Lagrangian finite difference schemes

In this paper, we aim to generalize semi-Lagrangian finite difference schemes for a system of two-dimensional (2D) Burgers' equations. Our scheme is not limited by the Courant-Friedrichs-Lewy (CFL) condition and therefore we can apply larger step size for the time variable. Proposed schemes can be implemented in parallel very well and in fact, it is a local one-dimensional (LOD) scheme which o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003